Cost‐optimal truck‐and‐robot routing for last‐mile delivery
نویسندگان
چکیده
During recent years, several companies have introduced small autonomous delivery robots and evidenced their technical applicability in field studies. However, a holistic planning framework for routing utilizing these is still lacking. Current literature focuses mainly on logistical performance of using robots, ignoring real world limitations, does not assess the respective impact total costs. In contrast, this paper presents an approach to cost-optimal truck-and-robot system last-mile deliveries with time windows, showing how minimize costs tour given number available robots. Our solution algorithm based combination neighborhood search cost-specific priority rules operators truck routing, while we provide evaluate two alternatives solve robot scheduling subproblem: exact heuristic approach. We show numerical experiments that our able reduce significantly. Within case study, concept reduces by up 68% compared truck-only delivery. Finally, apply sensitivity analyses managerial guidance when can efficiently be used industry.
منابع مشابه
A Customized Bi-Objective Location-Routing Problem for Locating Post Offices and Delivery of Post Parcels
One of the most important problems for distribution companies is to find the best locations for depots and to find proper routes for transportation vehicles and to optimize supply network. This study intends to develop a model for the problem of location-routing in post offices. So, a new Bi-Objective Location-Routing Problem for Locating Town Post Office and Routing Parcels is defined. This pr...
متن کاملA Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملMulti-objective routing and scheduling for relief distribution with split delivery in post-disaster response
Following the occurrence of unexpected events and natural disasters, a highly important relief operation is the transferring of relief commodities from the distribution centers (CDs) to shelters. In this paper, a three-level network consisting of depot of vehicles, distribution centers and shelters has been considered for routing and scheduling of relief vehicles through introducing a multi-obj...
متن کاملImproved routing strategies for Internet traffic delivery.
We analyze different strategies aimed at optimizing routing policies in the Internet. We first show that for a simple deterministic algorithm the local properties of the network deeply influence the time needed for packet delivery between two arbitrarily chosen nodes. We next rely on a real Internet map at the autonomous system level and introduce a score function that allows us to examine diff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2021
ISSN: ['0028-3045', '1097-0037']
DOI: https://doi.org/10.1002/net.22030